A Poisson Approximation for an Occupancy Problem with Collisions
نویسنده
چکیده
We study collision probabilities concerning the simple balls-and-bins problem developed byWendl (2003). In this article we give the factorial moment of the number of collisions. Moreover, we obtain a Poisson approximation for the number of collisions using the Chen–Stein method.
منابع مشابه
Univariate approximations in the infinite occupancy scheme
In the classical occupancy scheme with infinitely many boxes, n balls are thrown independently into boxes 1, 2, . . ., with probabilities pj , j ≥ 1. We establish approximations to the distributions of the summary statistics Kn, the number of occupied boxes, and Kn,r, the number of boxes containing exactly r balls, within the family of translated Poisson distributions. These are shown to be of ...
متن کاملOn the bounds in Poisson approximation for independent geometric distributed random variables
The main purpose of this note is to establish some bounds in Poisson approximation for row-wise arrays of independent geometric distributed random variables using the operator method. Some results related to random sums of independent geometric distributed random variables are also investigated.
متن کاملApproximating Bayes Estimates by Means of the Tierney Kadane, Importance Sampling and Metropolis-Hastings within Gibbs Methods in the Poisson-Exponential Distribution: A Comparative Study
Here, we work on the problem of point estimation of the parameters of the Poisson-exponential distribution through the Bayesian and maximum likelihood methods based on complete samples. The point Bayes estimates under the symmetric squared error loss (SEL) function are approximated using three methods, namely the Tierney Kadane approximation method, the importance sampling method and the Metrop...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملCompetition between discrete random variables, with applications to occupancy problems
Consider n players whose ‘‘scores’’ are independent and identically distributed values fXigi 1⁄4 1 from some discrete distribution F. We pay special attention to the cases where (i) F is geometric with parameter p-0 and (ii) F is uniform on f1;2; . . . ;Ng; the latter case clearly corresponds to the classical occupancy problem. The quantities of interest to us are, first, the U-statistic W whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008